On Zanello’s lower bound for level algebras
نویسندگان
چکیده
منابع مشابه
A unified lower bound estimation technique for high-level synthesis
A Unified Lower Bound Estimation Technique for High-Level Synthesis The importance of effective lower bound estimation (LBE) techniques is well-established in HighLevel Synthesis (HLS), since it allows more efficient exploration of the design space while providing other HLS tools with the capability of predicting the effect of specific tools on the design space. Much of previous work has focuse...
متن کاملLower Bound on Testing
We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...
متن کاملOn Lower Bound for W(K2n)
The lower boundW (K2n) ≥ 3n−2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K2n. Let G = (V (G), E(G)) be an undirected graph without loops and multiple edges [1], V (G) and E(G) be the sets of vertices and edges of G, respectively. The degree of a vertex x ∈ V (G) is denoted by dG(x), the maximum degree of a vertex of G-by ∆(G), and the...
متن کاملLower Bound for String Matching on PRAM
Breslauer and Galil have shown that the string matching problem requires (d n p e + log log d1+p=ne 2p) rounds in the parallel comparison tree model with p comparisons in each round. In this note we show that the same lower bound even holds for the p-processor abstract Priority-CRCW PRAMs with bounded but arbitrary large memory. In this model one assumes that the internal computational power of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11427-3